A Note on Efficient Computation of All Abelian Periods in a String
نویسندگان
چکیده
We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in 1997. By the way we show an alternative algorithm for Abelian squares. We also obtain a linear time algorithm finding all “long” Abelian periods. The aim of the paper is a (new) reduction of the problem of all Abelian periods to that of (already solved) all Abelian squares which provides new insight into both connected problems.
منابع مشابه
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems
Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for the computation of all abelian periods of a string were given. In contrast to the classical period of a word, its abelian version is more flexible, factors of the word are considered the same under any internal permuta...
متن کاملA Note on Easy and Efficient Computation of Full Abelian Periods of a Word
Constantinescu and Ilie (Bulletin of the EATCS 89, 167–170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement O(n log logn)-time algorithm for computing all the full Abelian periods of a word of length n over a constant-size alphabet. Experiments ...
متن کاملComputing Abelian regularities on RLE strings
Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, . . . , vs of strings such that v1, . . . , vs−1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said t...
متن کاملA SHORT NOTE ON ATOMS AND COATOMS IN SUBGROUP LATTICES OF GROUPS
In this paper we give an elementary argument about the atoms and coatoms of the latticeof all subgroups of a group. It is proved that an abelian group of finite exponent is strongly coatomic.
متن کاملComputation of Slip analysis to detect adhesion for protection of rail vehicle and derailment
Adhesion level for the proper running of rail wheelset on track has remained a significant problem for researchers in detecting slippage to avoid accidents. In this paper, the slippage of rail wheels has been observed applying forward and lateral motions to slip velocity and torsion motion. The longitudinal and lateral forces behavior is watched with respect to traction force to note correlatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013